Identification and Convexity in Optimizing Control

Identi cation and Convexity in Optimizing

The interplay between identiication of a predictor and the convexity of an associated optimization-based control problem is studied. The reason for the appearance of nonconvexity is investigated and a method to favour convexity of the optimization-based control problem in the identiication problem is suggested. Further, a parametrization which makes the identiication problem tractable is propos...

Optimizing Disparity Candidates Space in Dense Stereo Matching

In this paper, a new approach for optimizing disparity candidates space is proposed for the solution of dense stereo matching problem. The main objectives of this approachare the reduction of average number of disparity candidates per pixel with low computational cost and high assurance of retaining the correct answer. These can be realized due to the effective use of multiple radial windows, i...

Optimal Operation of a DWC by Self-Optimizing Control: Active Vapor Split Approach

Dividing Wall Column(DWC) offers the large potential for operating and capital cost saving in compared with conventional distillation sequence. In the studied DWC in this study, the aid of Vmin diagrams, it is shown that without a suitable value for vapor split fraction bellow the dividing wall in different operating conditions, the energy requirement increases from optimal value and it wil...

Approximate Convexity and Submonotonicity in Locally Convex Spaces

Calculating Cost Efficiency with Integer Data in the Absence of Convexity

One of the new topics in DEA is the data with integer values. In DEA classic models, it is assumed that input and output variables have real values. However, in many cases, some inputs or outputs can have integer values. Measuring cost efficiency is another method to evaluate the performance and assess the capabilities of a single decision-making unit for manufacturing current products at a min...